Robby G. Mckilliam and I. Vaughan L. Clarkson, Identifiability and Aliasing in Polynomial-phase Signals

نویسندگان

  • Robby G. McKilliam
  • Vaughan L. Clarkson
چکیده

Polynomial-phase signals have numerous applications including radar, sonar, geophysics, and radio communication. Many techniques for estimating the parameters of polynomial-phase signals have been described in the literature. Despite the significant interest, aliasing of polynomial-phase parameters has not been fully clarified. We address the problem of identifiability and aliasing in polynomial-phase signals. We fully describe the region in which aliasing does not occur for polynomialphase signals of any order. We call this the identifiable region. We find that this region is the Voronoi region of a lattice generated by the coefficients of a set of polynomials known as the integer-valued polynomials. We show how aliasing can be resolved by solving the nearest lattice point problem. We discuss some of the consequences of these results on a popular estimator for polynomial-phase signals that is based on the discrete polynomial phase transform (DPPT). It is shown that the range of parameters suitable for the DPPT estimator is very small compared to the identifiable region.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the error performance of the $A_n$ lattices

We consider the root lattice An and derive explicit recursive formulae for the moments of its Voronoi cell. These formulae enable accurate prediction of the error probability of lattice codes constructed from An.

متن کامل

An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$

The lattice A∗ n is an important lattice because of its covering properties in low dimensions. Clarkson [1] described an algorithm to compute the nearest lattice point in A∗ n that requires O(n log n) arithmetic operations. In this paper, we describe a new algorithm. While the complexity is still O(n log n), it is significantly simpler to describe and verify. In practice, we find that the new a...

متن کامل

Finding a closest point in a lattice of Voronoi's first kind

We show that for those lattices of Voronoi’s first kind with known obtuse superbasis, a closest lattice point can be computed in O(n) operations where n is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most n terms. Each vector in the series can be efficiently comp...

متن کامل

On the Cramér-Rao bound for polynomial phase signals

Polynomial-phase signals have applications including radar, sonar, geophysics, and radio communication. Of practical importance is the estimation of the parameters of a polynomial phase signal from a sequence of noisy observations. We derive closed form formulae for the Cramér-Rao lower bounds of these parameters under the assumption that the noise is additive white and Gaussian. This is achiev...

متن کامل

A P ] 2 N ov 2 01 2 POLYNOMIAL PHASE ESTIMATION BY PHASE UNWRAPPING

Estimating the coefficients of a noisy polynomial phase signal is important in fields including radar, biology and radio communications. One approach attempts to perform polynomial regression on the phase of the signal. This is complicated by the fact that the phase is wrapped modulo 2π and must be unwrapped before regression can be performed. In this paper we consider an estimator that perform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009